Separability of rational relations in A* × Nm by recognizable relations is decidable
نویسندگان
چکیده
Given a direct product of monoids M = A∗ ×Nm where A is finite and N is the additive monoid of nonnegative integers, the following problem is recursively decidable: given two rational subsests of M , does there exist a recognizable subset which includes one of the subsets and excludes the other.
منابع مشابه
On the separability of sparse context-free languages and of bounded rational relations
This paper proves two results. 1) Given two bounded contextfree langauges, it is recursively decidable whether or not there exists a regular language which includes the first and is disjoint with the second and 2) Given two rational k-ary bounded relations it is recursively decidable whether or not there exists a recognizable relation which includes the first and is disjoint with the second.
متن کاملSeparability of rational subsets by recognizable subsets is decidable in A∗ × N
Given a direct product of monoids M = A∗ ×N where A is finite and N is the additive monoid of nonnegative integers, the following problem is recursively decidable: given two rational subsests of M , does there exist a recognizable subset which includes one of the subsets and excludes the other.
متن کاملGraph Logics with Rational Relations
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use conditions on paths expressed by regular languages and relations, but they often need to be extended by rational relations such as subword or subse...
متن کاملDecision problems among the main subfamilies of rational relations
We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we investigate the following decision problem: given a relation in one of the family, does it belong to a smaller family? We settle the problem entirely when all monoids have a unique generator and fill some gaps in the gen...
متن کاملDecision Problems for Subclasses of Rational Relations over Finite and Infinite Words
We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words, where the problem is decidable. Furthermore, we show that it is decidable in doubly exponential time for an automatic relation over infi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 99 شماره
صفحات -
تاریخ انتشار 2006